package esercitazione3.tda_BinaryTree;

import esercitazione3.tda_NodeList.Position;
import esercitazione3.exceptions.BoundaryViolationException;
import esercitazione3.exceptions.InvalidPositionException;

public interface BinaryTree<E> extends Tree<E>{

	public Position<E> left(Position<E> v) throws InvalidPositionException, BoundaryViolationException;
	public Position<E> right(Position<E> v) throws InvalidPositionException, BoundaryViolationException;
	public boolean hasLeft(Position<E> v) throws InvalidPositionException;
	public boolean hasRight(Position<E> v) throws InvalidPositionException;
	
}
